Fuzzy Automata Induction using Construction Method

نویسندگان

  • Mo Zhi Wen
  • Zhi Wen
چکیده

Recurrent neural networks have recently been demonstrated to have the ability to learn simple grammars. In particular, networks using second-order units have been successfully at this task. However, it is often difficult to predict the optimal neural network size to induce an unknown automaton from examples. Instead of just adjusting the weights in a network of fixed topology, we adopt the dynamic networks (i.e. the topology and weights can be simultaneously changed during training) for this application. We apply the idea of maximizing correlation in the cascade-correlation algorithm to the second-order single-layer recurrent neural network to generate a new construction algorithm and use it to induce fuzzy finite state automata. The experiment indicates that such a dynamic network performs well.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metamorphosis of Fuzzy Regular Expressions to Fuzzy Automata using the Follow Automata

To deal with system uncertainty, finite automata have been generalized into fuzzy automata. Stamenkovic and Ciric proposed an approach using the position automata for the construction of fuzzy automata from fuzzy regular expressions. There exist multifarious methodologies for the construction of finite automata from regular expressions known as Thompson construction, Antimirov partial derivativ...

متن کامل

BL-general fuzzy automata and minimal realization: Based on the associated categories

The present paper is an attempt to study the minimal BL-general fuzzy automata which realizes the given fuzzy behavior. Of two methods applied for construction of such automaton presented here, one has been based on Myhill-Nerode's theory while the other has been based on derivatives of the given fuzzy behavior. Meanwhile, the categories of BL-general fuzzy automata and fuzzy behavior, along wi...

متن کامل

Heuristic Model of Cellular Learning Automata for Fuzzy Rule Extraction

In this study, a new method has been proposed for rule extraction required for a fuzzy classification system using Cellular Learning Automata Based on Evolutionary Computing (CLA-EC) model. CLA-EC model is an evolutionary algorithm which is a result of the combination of a cellular learning automata with the concepts mentioned in evolutionary computing. It has been shown a higher applicability ...

متن کامل

Myhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata

Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...

متن کامل

Multidimensional fuzzy finite tree automata

This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006